Susceptible-infected-susceptible epidemics on the complete graph and the star graph: Exact analysis
نویسندگان
چکیده
منابع مشابه
Susceptible-infected-susceptible epidemics on the complete graph and the star graph: exact analysis.
Since mean-field approximations for susceptible-infected-susceptible (SIS) epidemics do not always predict the correct scaling of the epidemic threshold of the SIS metastable regime, we propose two novel approaches: (a) an ε-SIS generalized model and (b) a modified SIS model that prevents the epidemic from dying out (i.e., without the complicating absorbing SIS state). Both adaptations of the S...
متن کاملUnified mean-field framework for susceptible-infected-susceptible epidemics on networks, based on graph partitioning and the isoperimetric inequality.
We propose an approximation framework that unifies and generalizes a number of existing mean-field approximation methods for the susceptible-infected-susceptible (SIS) epidemic model on complex networks. We derive the framework, which we call the unified mean-field framework (UMFF), as a set of approximations of the exact Markovian SIS equations. Our main novelty is that we describe the mean-fi...
متن کاملPerturbative solution to susceptible-infected-susceptible epidemics on networks.
Herein we provide a closed form perturbative solution to a general M-node network susceptible-infected-susceptible (SIS) model using the transport rates between nodes as a perturbation parameter. We separate the dynamics into a short-time regime and a medium-to-long-time regime. We solve the short-time dynamics of the system and provide a limit before which our explicit, analytical result of th...
متن کاملSurvival time of the susceptible-infected-susceptible infection process on a graph.
The survival time T is the longest time that a virus, a meme, or a failure can propagate in a network. Using the hitting time of the absorbing state in an uniformized embedded Markov chain of the continuous-time susceptible-infected-susceptible (SIS) Markov process, we derive an exact expression for the average survival time E[T] of a virus in the complete graph K_{N} and the star graph K_{1,N-...
متن کاملNodal infection in Markovian susceptible-infected-susceptible and susceptible-infected-removed epidemics on networks are non-negatively correlated.
By invoking the famous Fortuin, Kasteleyn, and Ginibre (FKG) inequality, we prove the conjecture that the correlation of infection at the same time between any pair of nodes in a network cannot be negative for (exact) Markovian susceptible-infected-susceptible (SIS) and susceptible-infected-removed (SIR) epidemics on networks. The truth of the conjecture establishes that the N-intertwined mean-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2013
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.87.012811